Reducing Carbon Emissions for the Vehicle Routing Problem by Utilizing Multiple Depots
نویسندگان
چکیده
Emission reductions could be achieved by replacing the single-depot mode with a multi-depot of vehicle routing. In our study, we identified situations under which multiple depots used to effectively reduce carbon emissions. We proposed branch-and-price (BAP) algorithm obtain an optimal solution for green routing problem. Based on BAP algorithm, accurately quantified emission reduction potential over mode. Factors such as number depots, speed, customer demand, and service time were considered analyzed. Computational tests conducted, results showed that using in problem can emissions at most 37.6%. sensitivity analyses, show relationships between these factors, several managerial insights successfully summarized.
منابع مشابه
Emissions Minimization Vehicle Routing Problem
Environmental, social and political pressures to limit the impacts associated with green house gas (GHG) emissions are mounting rapidly. To date there has been no or limited research which seeks to reduce emissions as the primary objective of a routing problem despite the fast growth and high impact of commercial vehicles. In the capacitated vehicle routing problem with time windows (VRPTW), it...
متن کاملMulti-Phase Meta-Heuristic for Multi-Depots Vehicle Routing Problem
In this work, we present a multi-phase hybrid algorithm based on clustering to solve the multi-depots vehicle routing problem (MDVRP). The proposed algorithm initially adopts K-means algorithm to execute the clustering analyses, which take the depots as the centroids of the clusters, for the all customers of MDVRP, then implements the local depth search using the Shuffled Frog Leaping Algorithm...
متن کاملVehicle Routing Problem for Emissions Minimization
There is extensive literature related to vehicle emissions, and several laboratory and field methods are available for estimating vehicle emissions rates (1). Research indicates that CO2 is the predominant transportation GHG and is emitted in direct proportion to fuel consumption, with a variation by type of fuel (2). For most vehicles, fuel consumption and the rate of CO2 per mile traveled dec...
متن کاملThe Prize-Collecting Vehicle Routing Problem with Single and Multiple Depots and Non-Linear Cost
In this paper, we propose a new routing problem to model a highly relevant planning task in small package shipping. We consider the Prize-Collecting Vehicle Routing Problem with Non-Linear cost (PCVRPNL) in its single and multi-depot version, which integrates the option of outsourcing customers to subcontractors instead of serving them with the private fleet. Thereby, a lower bound on the total...
متن کاملLocating Depots for Capacitated Vehicle Routing
We study a location-routing problem in the context of capacitated vehicle routing. The input to k-LocVRP is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constantfactor a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainability
سال: 2022
ISSN: ['2071-1050']
DOI: https://doi.org/10.3390/su14031264